Super-Simple Resolvable Balanced Incomplete Block Designs with Block Size 4 and Index 4
نویسندگان
چکیده
The necessary conditions for the existence of a super-simple resolvable balanced incomplete block design on v points with block size k = 4 and index λ = 2, are that v ≥ 16 and v ≡ 4 (mod 12). These conditions are shown to be sufficient. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 341–356, 2007
منابع مشابه
Super-simple balanced incomplete block designs with block size 4 and index 5
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...
متن کاملSuper-simple balanced incomplete block designs with block size 5 and index 3
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in constructing codes and designs such as superimposed codes and perfect hash families. The existence of super-simple (v, 4, λ)BIBDs have been determined for λ = 2, 3, 4, 5, 6. In this paper, we investigate the existence...
متن کاملResolvable balanced incomplete block designs with subdesigns of block size 4
In this paper, we look at resolvable balanced incomplete block designs on v points having blocks of size 4, briefly (v, 4, 1) RBIBDs. The problem we investigate is the existence of (v, 4, 1) RBIBDs containing a (w, 4, 1) RBIBD as a subdesign. We also require that each parallel class of the subdesign should be in a single parallel class of the containing design. Removing the subdesign gives an i...
متن کاملVarious super-simple designs with block size four
In this note the existence of a (Vj P2j 4, 2) BTD I for P2 = 0, 1 and 2, in which any pair of blocks intersect in at most two elements, is proved for any admissible v. A balanced ternary design is a collection of multi-sets of size k, chosen from a v-set in such a way that each element occurs 0, 1 or 2 times in anyone block, each pair of non-distinct elements, {x, x}, occurs in P2 blocks of the...
متن کاملBalanced ternary designs with holes and numbers of common triples
There exists a balanced ternary design with block size 3 and index 2 on 2v P2 + 4 and 2v P2 + 1 elements with a hole of size v, for all positive integers v and P2, such that v ~ 2P2 + 1. As an application of this result, we determine the numbers of common triples in two simple balanced ternary designs with block size 3 and index 2, for P2 = 3 and 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2013